Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
نویسندگان
چکیده
منابع مشابه
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions. The central question that we address is: what is the probability of the set of paths of C that are accepted by A, i.e., the likelihood that C satisfies A? It is shown that under finite a...
متن کاملModel Checking Markov Chains Against Unambiguous Buchi Automata
An automaton is unambiguous if each word has at most one accepting run and separated if no word is accepted from two distinct states. The classical translation of LTL formulas to Büchi automata [5] produces unambiguous separated automata since the states of such automata correspond to complete subformula types. Motivated by this observation, Couvreur et al. [3] present a polynomialtime algorith...
متن کاملApproximate Symbolic Model Checking of Continuous-Time Markov Chains
This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al 1]. The considered logic contains a time-bounded until-operator and a novel operator to express steady-state probabilities. We show that the model checking problem for this logic reduces to a system of linear equations (for unbounded unt...
متن کاملSmoothed Model Checking for Uncertain Continuous Time Markov Chains
We consider the problem of computing the satisfaction probability of a formula for stochastic models with parametric uncertainty. We show that this satisfaction probability is a smooth function of the model parameters. This enables us to devise a novel Bayesian statistical algorithm which performs model checking simultaneously for all values of the model parameters from observations of truth va...
متن کاملModel Checking Continuous-Time Markov Chains by Transient Analysis
The verification of continuous-time Markov chains (CTMCs) against continuous stochastic logic (CSL) [3, 6], a stochastic branchingtime temporal logic, is considered. CSL facilitates among others the specification of steady-state properties and the specification of probabilistic timing properties of the form P⊲⊳p(Φ1 U I Φ2), for state formulas Φ1 and Φ2, comparison operator ⊲⊳, probability p, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(1:12)2011